Quasi-polynomial tractability
نویسندگان
چکیده
Tractability of multivariate problems has become nowadays a popular research subject. Polynomial tractability means that the solution of a d-variate problem can be solved to within ε with polynomial cost in ε−1 and d. Unfortunately, many multivariate problems are not polynomially tractable. This holds for all non-trivial unweighted linear tensor product problems. By an unweighted problem we mean the case when all variables and groups of variables play the same role. It seems natural to ask what is the “smallest” non-exponential function T : [1,∞) × [1,∞) → [1,∞) for which we have T -tractability of unweighted linear tensor product problems. That is, when the cost of a multivariate problem can be bounded by a multiple of a power of T (ε−1, d). Under natural assumptions, it turns out that this function is T (x, y) = exp ( (1 + ln x) (1 + ln y) ) for all x, y ∈ [1,∞). The function T qpol goes to infinity faster than any polynomial although not “much” faster, and that is why we refer to T qpol-tractability as quasi-polynomial tractability. The main purpose of this paper is to promote quasi-polynomial tractability especially for the study of unweighted multivariate problems. We do this for the worst case and randomized settings and for algorithms using arbitrary linear functionals or only function values. We prove relations between quasi-polynomial tractability in these two settings and for the two classes of algorithms.
منابع مشابه
Tractability of the Quasi-Monte Carlo Quadrature with Halton Points for Elliptic Pdes with Random Diffusion
This article is dedicated to the computation of the moments of the solution to stochastic partial differential equations with log-normal distributed diffusion coefficient by the Quasi-Monte Carlo method. Our main result is the polynomial tractability for the QuasiMonte Carlo method based on the Halton sequence. As a by-product, we obtain also the strong tractability of stochastic partial differ...
متن کاملStrong tractability of multivariate integration using quasi-Monte Carlo algorithms
We study quasi–Monte Carlo algorithms based on low discrepancy sequences for multivariate integration. We consider the problem of how the minimal number of function evaluations needed to reduce the worst-case error from its initial error by a factor of ε depends on ε−1 and the dimension s. Strong tractability means that it does not depend on s and is bounded by a polynomial in ε−1. The least po...
متن کاملOn the numerical solution of integral equations of the fourth kind with higher index: differentiability and tractability index-3
In this paper, we consider a particular class of integral equations of the fourth kind and show that tractability and differentiability index of the given system are 3. Tractability and dierentiability index are introduced based on the-smoothing property of a Volterra integral operator and index reduction procedure, respectively. Using the notion of index, we give sucient conditions for the exi...
متن کاملTractability of Multivariate Integration for Periodic Functions
We study multivariate integration in the worst case setting for weighted Korobov spaces of smooth periodic functions of d variables. We wish to reduce the initial error by a factor ε for functions from the unit ball of the weighted Korobov space. Tractability means that the minimal number of function samples needed to solve the problem is polynomial in ε−1 and d. Strong tractability means that ...
متن کاملWeak and quasi-polynomial tractability of approximation of infinitely differentiable functions
We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of dimensionality. We show that renorming the space of infinitely differentiable functions in a suitable way allows weakly tractable uniform approximation by using only func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Complexity
دوره 27 شماره
صفحات -
تاریخ انتشار 2011